Constructing a transition route in a data communication network

ABSTRACT

A method is described of constructing a transition route in a data communication network having as components nodes and links. Upon receipt of a transition notification identifying a first component a non-neighboring node constructs a transition route around the first component. In an embodiment, a node performs detecting the first component transition; issuing a transition notification identifying the first component and recognizable by nodes configured to construct a transition route around the first component; and upon expiry of a notification transition period, issuing a transition advertisement recognizable by all nodes on the network.

CROSS-REFERENCE TO RELATED APPLICATIONS Priority Claim

This application claims benefit as a Divisional of application Ser. No.10/442,589, filed May 20, 2003 the entire contents of which is herebyincorporated by reference as if fully set forth herein, under 35 U.S.C.§120. The applicant(s) hereby rescind any disclaimer of claim scope inthe parent application(s) or the prosecution history thereof and advisethe USPTO that the claims in this application may be broader than anyclaim in the parent application(s).

FIELD OF THE INVENTION

The present invention generally relates to routing of data in a network.The invention relates more specifically to a method and apparatus forconstructing a transition route in a data communications network.

BACKGROUND OF THE INVENTION

The approaches described in this section could be pursued, but are notnecessarily approaches that have been previously conceived or pursued.Therefore, unless otherwise indicated herein, the approaches describedin this section are not prior art to the claims in this application andare not admitted to be prior art by inclusion in this section.

In computer networks such as the Internet, packets of data are sent froma source to a destination via a network of links (communication pathssuch as telephone or optical lines) and nodes (usually routers directingthe packet along one or more of a plurality of links connected to it)according to one of various routing protocols.

One class of routing protocol is the link state protocol. The link stateprotocol relies on a routing algorithm resident at each node. Each nodeon the network advertises, throughout the network, links to neighboringnodes and provides a cost associated with each link which can be basedon any appropriate metric such as link bandwidth or delay and istypically expressed as an integer value. A link may have an asymmetriccost, that is, the cost in the direction AB along a link may bedifferent from the cost in a direction BA. Based on the advertisedinformation in the form of a link state packet (LSP) each nodeconstructs a link state database (LSDB) which is a map of the entirenetwork topology and from that constructs generally a single optimumroute to each available node based on an appropriate algorithm such as,for example, a shortest path first (SPF) algorithm. As a result a“spanning tree” is constructed, rooted at the node and showing anoptimum path including intermediate nodes to each available destinationnode. Because each node has a common LSDB (other than when advertisedchanges are propagating around the network) any node is able to computethe spanning tree rooted at any other node. The results of the SPF arestored in a routing information base (RIB) and based on these resultsthe forwarding information base (FIB) or forwarding table is updated tocontrol forwarding of packets appropriately.

As a result when a packet for a destination node arrives at a node(which we term here the “first node”), the first node identifies theoptimum route to that destination and forwards the packet to the nextnode along that route. The next node repeats this step and so forth. Insome circumstances it is desirable to have more control over the routethat a packet takes in which case “tunneling” can be used. According tothis scheme if a node A receives a packet destined for node Z and forsome reason it is desired that the packet should travel via node Y,under normal circumstances node A would have no control over this(unless Y was an adjacent node), as the route is dependent on theforwarding table generated as a result of the SPF at node A and anyintermediate nodes as well. However node A can “tunnel” the packet tonode Y by encapsulating the received packet within a packet havingdestination node Y and sending it to node Y which acts as the tunnel endpoint. When the packet is received at node Y it is decapsulated and Ythen forwards the original packet to node Z according to its standardforwarding table. Yet further control is available using directedforwarding in which the encapsulated packet includes a specificinstruction as to which neighboring node of the end point of the tunnelthe encapsulated packet should be sent, which comprises the “releasepoint”.

It will be noted that in normal forwarding each node decides,irrespective of the node from which it received a packet, the next nodeto which the packet should be forwarded. In some instances this can giverise to a “loop”. In particular this can occur when the databases (andcorresponding forwarding information) are temporarily de-synchronizedduring a routing transition, that is, where because of a change in thenetwork, a new LSP is propagated. As an example, if node A sends apacket to node Z via node B, comprising the optimum route according toits SPF, a situation can arise where node B, according to its SPFdetermines that the best route to node Z is via node A and sends thepacket back. This can continue for as long as the loop remains althoughusually the packet will have a maximum hop count after which it will bediscarded. Such a loop can be a direct loop between two nodes or anindirect loop around a circuit of nodes.

One solution for avoiding loops during a routing transition is describedin co-pending patent application Ser. No. 10/323,358, filed 17 Dec.2002, entitled “Method and Apparatus for Advertising a Link Cost in aData Communications Network” of Michael Shand (Shand), the entirecontents of which are incorporated by reference for all purposes as iffully set forth herein. According to the solution put forward in Shand,when a node detects deactivation of an adjacent link or node, theninstead of advertising the failure of the component, for example bysimply removing the link from the LSP, the node that detectsdeactivation increments the associated link costs and advertises theincremented cost. As a result even when nodes have different LSDBsbecause of finite propagation and processing time of the LSP carryingthe incremented link cost, loops are not set up in the remainder of thenetwork. Once all nodes have updated their LSDBs, the detecting nodeincrements the cost and advertises the incremented cost again. Howeverin some circumstances it is desirable to converge on a common view of anetwork more quickly than is permitted by this incremental approach.

One alternative approach to dealing with link failure is described indocument “Fortifying OSPF/IS-IS Against Link-Failure” by Mikkel Thorup(“Thorup”) which is available at the time of writing on the file“lf_ospf.ps” in the directory “˜mthorup\PAPERS” of the domain“research.att.com” on the World Wide Web. The approach of Thorup is topre-compute the SPF at each node for each possible link failure. When alink failure is advertised the node forwards along its pre-computedupdated path whilst updating the LSDB in the background.

Various problems arise with the approach. Thorup requires increasedstorage and computing to deal with all possible routes around allpossible failures, as well as extra forwarding code requirements.Significantly Thorup does not address the problem of loop formationduring a transition.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by wayof limitation, in the figures of the accompanying drawings and in whichlike reference numerals refer to similar elements and in which:

FIG. 1 is a representation of a network that illustrates an overview ofa method for constructing a transition route;

FIG. 2 is a flow diagram illustrating a high level view of a method forconstructing a transition route;

FIG. 3 is a representation of the network of FIG. 1 in which a repairpath and transition route have been installed;

FIG. 4A is a flow diagram illustrating in more detail steps involved inconstructing a transition route;

FIG. 4B is a continuation of FIG. 4A and is a flow diagram illustratingin more detail steps involved in constructing a transition route;

FIG. 4C is a representation of a network that illustrates in more detailthe steps involved in constructing a transition route;

FIG. 4D is a spanning tree diagram for a node in the network shown inFIG. 4C;

FIG. 4E shows the spanning tree diagram of FIG. 4D with directedforwarding;

FIG. 4F is a reverse spanning tree diagram for a node in the networkdiagram of FIG. 4C;

FIG. 4G is a reverse spanning tree for another node in the networkdiagram of FIG. 4C;

FIG. 4H is a spanning tree diagram for another node in the network shownin FIG. 4C;

FIG. 4I is a reverse spanning tree diagram for another node in thenetwork diagram of FIG. 4C;

FIG. 5 is a flow diagram showing in more detail a transition managementstrategy;

FIG. 6 is a representation of the network of FIG. 1 showing fullinstallation of transition routes and repair paths;

FIG. 7 is a flow diagram showing in more detail a transition repairstrategy;

FIG. 8 is a representation of the network of FIG. 1 showing transitionand repair paths removed and new paths installed; and

FIG. 9 is a block diagram that illustrates a computer system upon whicha method for determining a repair strategy may be implemented.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

A method and apparatus for constructing a transition route in a datacommunications network is described. In the following description, forthe purposes of explanation, numerous specific details are set forth inorder to provide a thorough understanding of the present invention. Itwill be apparent, however, to one skilled in the art that the presentinvention may be practiced without these specific details. In otherinstances, well-known structures and devices are shown in block diagramform in order to avoid unnecessarily obscuring the present invention.

Embodiments are described herein according to the following outline:

-   -   1.0 General Overview    -   2.0 Structural and Functional Overview    -   3.0 Method of Constructing a Transition Route    -   4.0 Implementation Mechanisms—Hardware Overview    -   5.0 Extensions and Alternatives        1.0 General Overview

The needs identified in the foregoing Background, and other needs andobjects that will become apparent from the following description, areachieved in the present invention, which comprises, in one aspect, amethod for constructing a transition route in a data communicationsnetwork having as components nodes and links defining a networktopology, around a first component. The method includes the step ofreceiving a transition notification and identifying the first component.The method further comprises the step of constructing a transition routearound the first component from a non-neighboring node thereof to atarget node. To construct the transition route a first set of nodesreachable from the non-neighboring node without traversing the firstcomponent is derived from the topology and a second set of nodes fromwhich the target node is reachable without traversing the firstcomponent is derived from the topology. The transition route isconstructed from the non-neighboring node to the target node via anintermediate node in an intersection of the first and seconds sets ofnodes.

In other aspects, the invention encompasses a computer apparatus and acomputer-readable medium configured to carry out the foregoing steps.

2.0 Structural and Functional Overview

The method can be further understood with respect to FIG. 1 whichdepicts an illustrative network diagram showing a method forconstructing a transition route. The network comprises a datacommunication network of nodes and links, which can be the Internet or asub-network such as a routing domain or a virtual network which isdesignated generally 10 and includes, as a first component, node B,reference number 12, as a non-neighboring node, node X, referencenumeral 14 and as a target node, node D, reference numeral 16. Node B isuntraversable, for example, because it has failed or because it has beenwithdrawn from service and as a result packets arriving at a neighbornode A, reference numeral 18, of failed node B cannot reach target nodeD via links 20 and 22 joining nodes A and B and B and D respectively,nor nodes that would normally be reachable via that path (referred to asthe Td space 34).

However routes are available from node A in the form of backup routes orrepair paths via node P, reference numeral 26, and node Q, referencenumeral 28 to node Y, reference numeral 30, in the Td space of node A.The path from node A to node P is designated generally 32 and may, inpractice, comprise a plurality of hops between nodes along the path.Nodes P and Q are joined by a link 34 and nodes Q and Y by path 36 whichagain may comprise multiple hops.

The manner in which the backup route is computed is described inco-pending patent application Ser. No. 10/340,371, filed 9 Jan. 2003,entitled “Method and Apparatus for Constructing a Backup Route in a DataCommunications Network” of Kevin Miles et al., Attorney docket no.50325-0734 (“Miles et al.”), the entire contents of which areincorporated by reference for all purposes as if fully set forth hereinand discussed in more detail below. In particular, node A computes afirst set of nodes comprising the set (which can be termed the“P-space”) 38 of all nodes reachable according to its routing protocolfrom node A, other than nodes reachable by traversing node B. Node Athen computes a second set of nodes comprising the set of all nodes fromwhich node D is reachable without traversing node B represented by space40 (the “Qd-space”). In one embodiment the P-space and Q-space arepre-computed.

The method then determines whether any intermediate nodes exist in theintersection between P-space and Q-space or a one hop-extension thereof.For example in FIG. 1 nodes P and Q are within one hop of one another.As a result, in the event of the failure of node B packets of data canbe sent from node A via path 32 as far as the intermediate node P thenvia link 34 node Q and thence via path 36 to the target node Y. Thelinks 32, 34 and 36 can be viewed together as a “virtual” link forming arepair path in the event that node B fails or an alternative route isotherwise required.

Where appropriate the method in Miles et al. avoids packets being sentto the intermediate node X looping back to node A by tunneling thepacket to node P. In that case the intermediate node P comprises thetunnel end point. Accordingly the initial repair path is formed bytunneling the packet destined to node Y from node A to node P, directedforwarding the packet from node P to node Q and then forwarding itnormally from node Q to node Y.

All nodes pre-compute backup routes for all adjacent components as aresult of which, as soon as a node detects de-activation of an adjacentcomponent or otherwise needs an alternative route, that route isimmediately available (although computation can alternatively be done inreal time). As a result packet loss is minimized. Because the link stateprotocol is effectively undisturbed according to this method the factthat a repair path has been used is transparent to the remainder of thenetwork. The labels “P-space”, “Q-space” and “T-space” are arbitrary andused for convenience and other embodiments may use any other label forthe respective sets of nodes.

In the system so far described, other routers in the network willforward packets as normal until the failure is advertised. Examples ofsuch non-neighboring nodes in FIG. 1 are node X, reference numeral 14,node X′, reference numeral 42 and node X″, reference numeral 44. Node X,for example, forwards packets to target addresses in Td-space 24 vianode X′ X″ and A and respective links 46, 48, 49. Once the packets arereceived at node A they will be forwarded along the repair path 32, 34,36, but this will place a tunneling burden on the tunnel start and endpoints (nodes A and P respectively). Furthermore once the failure ofnode B is advertised by node A the processing and propagation time cangive rise to loops as a result of the desynchronized LSDBs.

FIG. 2 is a flow diagram illustrating a high level view of a method ofconstructing a transition route in a data communications network whichaddresses the looping problem, with reference to the network shown inFIG. 1. In block 60 node A implements its repair paths on detection of afailure, and issues a “covert announcement” or transition notificationthat the path AB is no longer available, signaling the start of phase 1,a notification transition period. The network is considered to be madeup of cooperating nodes, that is nodes such as nodes X, X′, X″ thatsupport the appropriate protocols for implementing the method describedherein and non-cooperating nodes, that is, those which continue tooperate and forward in a conventional manner during the routingtransition. In block 62 the cooperating nodes receive and recognize thecovert announcement (non co-operating nodes do not recognize the covertannouncement but merely pass it on). In block 64 each cooperating nodeconstructs its transition routes. In particular it calculates itsrespective P-space, that is, the set of nodes reachable according to itsrouting protocol other than nodes reachable by traversing node B, inexactly the same manner as node A calculates its P-space. In the samemanner each cooperating node calculates Q-space, that is, the set ofnodes from which the target node is reachable without traversing node Bwhich will be the same irrespective of the identity of the calculatingnode. Once again, using the same techniques as node A, the cooperatingnode hence constructs and implements a set of transition routes.

Referring to FIG. 3, which depicts an illustrative network showing aconstructed transition route, it will be seen that a transition routefrom node X′ to node Y runs via a path 100 which comprise multiple hopsas appropriate to node P′ in the P-space of X′ and thence, via directedforwarding over link 104 to node Q′ reference numeral 106, in Q-spaceand then via path 108 to node Y.

Referring to FIG. 2, in block 66, at the end of the phase 1 timer alltransition tunnels are in place and being used as repair paths and nodeA issues a normal LSP describing the failure and starting phase 2, anadvertisement transition period. All non-cooperating nodes, which up tonow have been operating as though the failure had not occurred, processthe LSP and update their forwarding tables in a conventional mannerduring phase 2. In block 70, the phase 2 timer ends and the phase 3timer starts. During phase 3, a repair transition period, thecooperating nodes remove the transition tunnels and replace them withupdated forwarding tables based on the normal LSP issued by node Anotifying the failure. In an optimization the LSDB data for updatingforwarding tables of the cooperating node, are updated during phase 2such that fast implementation can be achieved. In block 72 the phase 3timer ends and node A removes its repair paths.

As result of the method loops are almost entirely avoided and removedaltogether once traffic reaches a co-operating router or if the networkcomprises only co-operating routers, and the transition is completedwithin a 3 phase time constraint which can be fixed in the system. Forexample in phase 1, while the cooperating nodes are setting uptransition routes or tunnels designed to avoid loops, even though thenon-cooperating nodes have not yet received notification of the failure,those packets that they forward towards node A will either be re-routedinto node A's repair paths or will fall into a transition tunnel whichhas been set up at one of the cooperating nodes and hence be correctlyforwarded to their destination without looping. As a result the order inwhich the cooperating nodes set up their transition routes isimmaterial. During phase 1 cooperating routes only need institutetransition routers for destinations reached via the failed component.

In phase 2, even though the non-cooperating nodes are updatedasynchronously as the failure notification LSP floods through thenetwork the possibility of loop formation is minimized. This is becauseany packets introduced into a tunnel from a cooperating node in phase 1will remain in that tunnel and any packets subsequently traversing acooperating node in phase 2 will be introduced into a transition tunnelwhich in either case will repair around the failure even if the repairpath transits a non co-operating node. As a result the only loops thatwill be created are for packets entering the network through, ororiginating at, non-cooperating nodes during phase 2, with nocooperating nodes in the potential loop. Yet further, the institution oftransition routes takes the encapsulation and decapsulation burden offthe tunnel start and end points in A's repair paths providing adistributed repair strategy.

Various optimizations are available. For example transition routes onlyneed to be instituted in those circumstances when the next hop willchange as a result of the failure or the next hop does not change but isa non-cooperating router. Furthermore cooperating nodes can skip phase 2altogether if the new next hop is a co-operating router. As a result themethod is yet quicker and requires less calculation. The method and itsoptimizations are discussed in more detail below.

3.0 Method of Constructing a Transition Route

The method described herein can be implemented according to anyappropriate routing protocol whereby a node in a network has sufficientinformation to predict the forwarding behavior of other nodes in astable network. Generally, link state protocols such as IntermediateSystem to Intermediate System (IS-IS) or Open Shortest Path First (OSPF)are appropriate protocols. Link state protocols of this type will bewell understood by the skilled reader and are not described in detailhere.

As discussed in the Structural and Functional Overview, the cooperatingrouters install transition tunnels or routes upon receipt of a covertnotification. The transition routes are constructed in the same manneras the repair paths from node A which is described in more detail inMiles et al. but for the purposes of completeness the principal pointsare described here.

In order to construct a backup route from a node X a spanning tree iscomputed rooted at node X. Those nodes reachable via the failedcomponent (node B) are excised, including nodes that, because of anequal cost path split (i.e. two possible paths with equal cost) could bereached by traversing the failed component. The excised nodes are easilyidentified by running an SPF algorithm and setting a flag in the datastructure when the failed component is explored, propagating that flagto all nodes reached via that component. In an optimization, in order toaccommodate directed forwarding, the spanning tree, is extended toinclude as reachable nodes any nodes that are one hop away from a nodealready in the set to allow directed forwarding. Additional hops can beadded if an appropriate encapsulation regime is supported.

The Q-space 40 is constructed in a similar manner. Where the failed nodeB has a single downstream neighbor node D, as shown in FIG. 1, thereverse spanning tree (or “sink tree”) is computed showing the routesfor each node from which node D is reachable, again excising all nodesfrom which node D is reached via the failed node B. In the case ofmultiple downstream neighbor nodes, the Q-space is derived for each ofthem. It will be appreciated that instead of extending the P-space toinclude additional nodes one hop away, Q-space can be extended instead,in conjunction with directed forwarding. In addition it would bepossible to run the SPF algorithm to obtain P and Q-space in any order.In some instances it will not be necessary to construct a Q-space as thetarget node is found in P-space—this is more likely to happen fornon-neighboring nodes.

As a result the respective release points from node X to node D can beobtained from the intersection of the respective (extended) P-space andQ-space sets.

Computation of the Q-space is dependent on whether a potential nodefailure or a potential link failure is being considered. If it is apotential link failure then it is enough to ensure that a repair path isconstructed around a link to the node the other side of it (node B astarget node) after which traffic would be forwarded normally. However ifnode B failed then clearly this approach would not work. In that case itwould be necessary to construct a repair path to each node neighboringthe failed node (other than the node A itself of course) on the basisthat the failed node would have forwarded the traffic to its neighboringnodes in any event, and the neighboring nodes would then normallyforward packets irrespective of how the packet reached them. It will beseen that the worst case scenario is node failure rather than linkfailure and so this scenario is principally addressed here.

FIGS. 4A and 4B are flow diagrams illustrating in more detail the methodfor constructing a backup route. In block 161 the spanning tree from therespective node (e.g. node X) is computed excluding nodes reached bytraversing the adjacent component. In the optimization discussed abovethe set of nodes obtained is extended by one hop in block 162 and anextended P space is constructed in block 164. The backup or transitionroute constructed is then dependent upon whether node failure or linkfailure is addressed as represented by option block 166. If node failureis addressed then at block 168 the reverse spanning tree is computed foreach neighbor of the failed node excluding nodes from which the neighboris reachable via the failed node. In block 170 the Q space isconstructed. If, at block 166, link failure is addressed then at block172 the reverse spanning tree is computed for the node adjacent thefailed link excluding nodes from which the adjacent node is reachablevia the failed link. In block 174, once again, the Q space isconstructed.

Turning to FIG. 4B, whichever failure type is addressed at block 166, atblock 176 the intermediate node is identified from the intersectionbetween P and Q space. In block 178 it is then assessed whether theintermediate node is in the extended P space. If it is then at block 180the transition route is constructed using tunneling and directedforwarding to the intermediate node. If the intermediate node is not inextended P-space then the transition route is constructed at block 182using tunneling to the intermediate node as discussed above.

In block 164 the P-space for node X can be extended very simply bycalculating the P-space for the neighbors to node X, which again can becalculated at node X from its LSDB. Because node X will inevitablyforward packets to one of these neighbors in the event that link 36 ornode B fails, the set of reachable nodes and hence potentially, releasepoints can be simply extended in this manner. It can be shown that theP-space can be derived individually for each neighboring node of afailed node or by running an SPF algorithm rooted at X but decreasingthe cost of nodes reachable over the neighboring node by an amountcomprising the cost of the direct link between the nodes less the sum ofthe shortest cost link in each direction (bearing in mind that thedirect link may not be the lowest cost link, and that there may beasymmetry). As a result individual SPFs rooted at each node do not needto be run.

If multiple repair paths are available (i.e. more than one pair oftunnel endpoint and release points are identified in the intersection ofP-space and Q-space) then the optimum repair path is selected on a leastcost basis, based on the cost to the release point (or tunnel endpointif these are coincident). In the present example, the cost is the costof the path that packets will actually traverse via the release pointincluding the cost of a new link over which directed forwarding isperformed as this represents a lower computational burden and may bemore representative than, say, the cost to the target via the repairpath. However the selection process can be optimized by stopping runningthe Q-space reverse SPF as soon as a node in the (extended) P-space isidentified. Although this may not find the shortest route this isoutweighed by the reduced computational burden. A yet furtheroptimization is to ensure that no downstream path (i.e. intermediatenodes comprising a neighbor of the repairing node and hence notrequiring a tunnel) is excluded. This is achieved by stopping runningthe reverse SPF algorithm at the earlier of:

having reached all neighbors of the repairing node via the failed link(in which case there can be no downstream path as these neighbors willhence not occur in Q-space) and having identified another release point;and

having reached a neighbor of the repairing node not via the failed link.Of course any appropriate manner of identifying the optimum repair pathcan be adopted.

Once the least cost repair path is assigned, there may still be multiplerepair paths, one for each neighbor of the failed component which is arepair path target. To identify which repair path should be used it isnecessary to assess the final destination of an incoming packet to therepairing node. This is achieved by recording which neighbor node wouldbe used to reach each destination via the failed component in normaloperation and assigning the traffic to the repair path generated withthe appropriate neighbor as target. Of course any destination notreachable via any of the neighbor nodes will not require a repair path(as they do not traverse the failed component).

Referring to FIG. 1 the adjacent component that fails is for examplelink 20 and it is assumed that node B has not failed or otherwise beende-activated. Accordingly it is simply necessary to calculate a repairpath from repairing node X with target node B rather than from node X tothe neighbors of node B as target nodes. As discussed in more detailbelow, the nature of the failure can be assessed at node A. This isadvantageous because node A can then advertise the information togetherwith the covert announcement.

In order to establish whether the failure is a link failure or a nodefailure, any appropriate failure detection mechanism can be adopted, forexample as described in co-pending patent application Ser. No.10/346,051, filed 15 Jan. 2003, entitled “Method and Apparatus forDetermining a Data Communication Network Repair Strategy”, of StewartBryant et al., Attorney docket no. 50325-0744 (Bryant et al.), theentire contents of which are incorporated by reference for all purposesas if fully set forth herein. According to the solution put forward inBryant et al, and referring to FIG. 1 hereof, when a node A (“thedetecting node”) detects a failure along an adjacent link which may bethe link itself or the node to which it is connected, the detecting nodeimplements a repair path around the link to node B as discussed in moredetail above, sends a loop detection packet along the repair path andstarts a timer with period t. The detecting node monitors for receipt ofa packet. If the received packet is an acknowledgement from node B thenevidently node B has not failed and the link repair strategy can bemaintained. If, however, the received packet is the loop detectionpacket this implies that node B has failed and the loop detection packethas looped back to the detecting node via another node that has noticedthat node B has failed. In those circumstances a node repair strategy isimplemented. If the timer times out without the detecting node receivingany packet, because of severe congestion, then it is assumed that thereis node failure and the node failure strategy is invoked. In either casethe nature of the failed component is announced together with the covertannouncement.

An illustrative example of a manner of constructing transition routes asdescribed above is set out with reference to FIGS. 4C to 4I. FIG. 4Cshows a network diagram of an illustrative network including node B, thecomponent to be traversed, reference 200, a neighboring node A, 202 anda link 204 joining them. Node B has two further neighbor nodes, nodes Cand D reference numbers 206, 208 respectively joined by respective links210, 212. Node A has an alternative path to node D via nodes W, X, V andZ, 214, 216, 218, 220 respectively and corresponding links 222, 224,226, 228 and 230. Node A also has an alternative path to node C vianodes F and G, 232, 234 and corresponding links 236, 238, 240. Node E,242, is reachable by either node C or node D by respective links 244,246. All of the links have a cost 1 except for link 238 between nodes Fand G which has a cost 3. As an example, transition routes will becalculated originating at nodes X and F around node B.

FIG. 4D is a spanning tree diagram routed at node X showing the shortestpath to each of the nodes. Those nodes reachable via the failedcomponent are shown shaded gray, namely nodes B, C, G. It will be seenfor example that node G is reachable via nodes B and C rather than vianode F because of the high link cost between nodes F and G.

FIG. 4E is a spanning tree diagram routed at node X but in additionshowing directed forwarding. In particular node C is within one hop ofnode E (represented by arrow 244) and node G is within one hope of nodeF (represented by arrow 246). Accordingly it will be seen that theextended P-space for node X comprises the set of potential releasepoints:

{A C D E F G W X V Z}

Of these nodes A, D, E, F, W, X, V, Z comprise tunnel end points whereasnode C and G require directed forwarding from nodes E and Frespectively.

Assuming node failure of node B it is necessary to calculate transitionroutes via each of its neighbors C and D (node A which notified thefailure to the cooperating router X in the first place is excluded).FIG. 4F is a reverse spanning tree diagram computed for node C and itwill be seen that nodes V, Z, D, X, W, A, B and F are shown shadedmeaning that node C is reached from those nodes via node B. Althoughnodes V, Z and D could reach node C via node E, because there is anequal cost path split at node D such that there is an equivalent costvia E or via B, nodes V, Z and D are excised. Accordingly the Q-spaceis:

{C E G}

It is not necessary to construct a reverse spanning tree from node Dbecause it is directly reachable from X as shown in FIG. 4E. Accordinglythe set of potential release points is the intersection of X's P-spaceand Q-space:

{A C D E F G W X V Z}∩{C E G}={C E G}.

From inspection of FIG. 4C, nodes E and G are the lowest cost, with cost4, but as directed forwarding is required to node G, the best releasepoint is node E which hence comprises the intermediate node.

If it is detected that the link 204 in FIG. 4C has failed and not node Bthen a link repair strategy is required in which case the reversespanning tree from node B must be computed. FIG. 4G is the reversespanning tree diagram from node B from which it can be seen that nodesA, W, X and F are shown shaded as packets from these nodes would havereached node B over the failed link 204.

In this case, therefore, the intersection of X's P-space with B'sQ-space is:

{A C D E F G W X V Z}∩{B C D E G V Z}={C D E G V Z}.

The lowest cost is node V which can be reached by first hop directedforwarding (that is, the packet from node X is direct forwarded to nodeV after which it will proceed by normal forwarding to node B withouttunneling being required.

FIG. 4H shows the extended spanning tree rooted at node F. The excisednodes are shown shaded and comprise nodes B, D and E, nodes C and Zbeing reachable from nodes G and V respectively as shown by respectivearrows 248, 250. As node C is reachable it is only necessary to considerthe reverse spanning tree routed at D. FIG. 4I is a reverse spanningtree diagram for node D and it will be seen that the excised nodes shownshaded are nodes A, B, C, F, G and W.

Accordingly the intersection of F's P-space with D's Q-space providesthe set of achievable release points:

{A C F G W X V Z}∩{D E X V Z}equals {X V Z}.

In the case of link repair from node F the set of nodes that can reachnode B without traversing the link A, B is {B C D E G V Z}. Theintersection of the set with router A's set of achievable release pointsis:

{A C F G X W X V Z}∩{B C D E G V Z}={C G V Z}.

Accordingly this intersection provides the potential intermediaterelease points from node F in the case of link failure of link 204 inFIG. 4C.

To illustrate implementation of the techniques described above, in thecontext of the illustrative network shown in FIG. 1, node X, in anattempt to reach node Y calculates its P-space by computing its spanningtree and excising all nodes reachable via node B. It then calculatesQ-space comprising all nodes from which node D is reachable withouttraversing node B. Either P-space or Q-space is extended by one hop andthe intersection found to identify the intermediate node. Packets aretunneled to the intermediate node and, if appropriate, directedforwarded. Once they reach node D then they will be forwarded on to Y bynormal forwarding. It will be noted that node X only needs to calculatedtransition routes for nodes reached via the failed component (i.e. theTd-space) as otherwise the route will be via components that do knowabout failure and will route around it, or do not know about thefailure, but would route around it in any event.

FIG. 5 is a flow diagram illustrating in more detail a method forconstructing a transition route. In particular FIG. 5 illustrates thesteps taken by a cooperating node in constructing a transition route. Inblock 110 the cooperating node receives a covert announcementidentifying a failed or otherwise untraversable component. At block 112the cooperating node identifies all nodes for which a destination nodeis reached via the failed components and either for which the next hopwill change as a result of the failure or the next hop does not changebut is a non-cooperating router. In block 104, for all of the identifiednodes transition routes are computed as discussed above. It will benoted that this approach is an optimization—transition routes could becomputed for every possible destination node. However, as discussedabove, there is evidently no need to compute transition routes for nodeswhose normal routing path is unaffected by the transition. Indeed if notraffic was flowing over the failed component prior to its failure therewould be no need to implement any transition tunnels.

Furthermore, if, for a given destination node, the next hop from thecooperating node does not change as a result of the transition, and thatnext hop is a cooperating router, there is no need to install thetransition route. This is because the packet will be forwarded to thenext hop cooperating router which will either know about the failure inwhich case it will have instituted its own transition strategy, or willnot know about the failure in which case it will continue to forward thepacket towards the failed component. As the neighboring node to thefailed component (node A in FIG. 1) has implemented a repairingstrategy, then even if the packet reaches node A it will be safelyre-routed.

Not all cooperating nodes will install transition routes simultaneously.Referring for example to FIG. 3 it will be seen that node X′ hasinstituted a transition route 103, 104, 108, but nodes X and X″ have notyet, and continue to forward normally. Referring however to FIG. 6 whichdepicts an illustrative network diagram representing the network of FIG.1, at the end of phase 1 with all transition routes installed, it willbe seen that X and X″ have installed respective routes 103, 101 to P′.For simplicity a single P′ and Q′ are shown but it will be appreciatedthat multiple tunnel end points and release points may be determined fordifferent cooperating nodes and different destinations.

The manner in which the relevant nodes are identified is optimally byidentifying the IP address prefixes for the respective destination nodesthat meet the conditions in block 112, computing the transition tunnelsneeded by the prefixes and assigning the prefixes to the respectivetransition tunnels, allowing a simple forwarding mechanism.

Reverting to FIG. 5, in block 116 the cooperating node receives a normalLSP advertising the failure. The normal LSP is issued at the terminationof a network wide phase 1 timer, of sufficient duration to ensure thatall the cooperating nodes install their transition routes. In analternative embodiment the normal LSP is issued when the issuing node(usually a neighbor node to the failed component) otherwise ascertainsthat all cooperating routers have completed installation of transitionroutes for example upon receipt of appropriate acknowledgement packetsfrom each cooperating node, optionally instigated by a request packetfrom the issuing node.

In block 118, at the beginning of the phase 2 timed period thecooperating nodes, in an optimization, compute their new LSDB based onthe failure notification but do not update their forwarding tables.During phase 2 the non-cooperating nodes in the network update theirforwarding tables on the basis of the LSP announcing the failure in theconventional manner.

In block 120, at the end of the phase 2 timer the cooperating nodesremove their transition routes and update their forwarding tables withthe pre-computed converged routes. Alternatively the converged routescan be calculated at the end of phase 2. In either case the convergedroutes can be computed based on the covert announcement or the normalLSP. The order in which the cooperating nodes replace their transitionroutes with the new paths is again immaterial. The phase 2 timer ensuresthat any non-cooperating routers have updated their forwarding tables.However in an optimization a cooperating node can proceed directly tothe end of phase 2 in relation to certain destinations on time out ofphase 1 if the next hop in the new path to the destination is to acooperating node, as in that case it will be possible to rely on thetransition strategy of the next hop. The phase 1 timer ensures howeverthat transition tunnel withdrawal cannot start until all transitiontunnels are installed. In block 120 all cooperating nodes, accordingly,install their new paths at the end of the phase 1 or phase 2 timer asappropriate. It is of course possible that more than one neighboringnode detects the failure and issues a covert announcement. In that casethe phase 2 timer should not start until overt announcements advertisingthe failure are received from all of the detecting nodes as otherwisethe cooperating nodes could begin to withdraw their transition tunnelstoo early which could give rise to loops.

FIG. 7 is a flow diagram illustrating in more detail the method stepsundertaken at a neighboring node to the failed component, for examplenode A shown in FIG. 1. In block 122 the neighboring node detectsfailure of an adjacent component. The manner in which failure isdetected will be well known to the skilled person and will be dependentupon the specific nature of the detecting node and the adjacentcomponent. In block 124 the detecting node installs the appropriatepre-computed repair path. In block 126 the detecting node detectswhether the failure is a node or a link failure as discussed in moredetail above. In block 128 the detecting node issues a covertannouncement of the failure and type: node or link, and starts the phase1 timer.

In block 130, on expiry of the phase 1 timer the neighboring node issuesa normal LSP advertising the failure. In block 132, on expiry of thephase 3 timer the neighboring node removes its repair paths and installsthe new paths. The new paths are, in an optimization, pre-computedduring the phase 1, 2 and 3 periods.

FIG. 8 depicts an illustrative network diagram showing the network inits final state in which the transition tunnels for X, X′, X″ and therepair paths from node A have been removed. For example it will be seenthat node X forwards to node Y via link 133, node Z, reference 134, link135 and then nodes P′, Q′ and Y. Node X′ forwards to node X″ via link136 and node X″ forwards to node X via link 137 after which the sameroute is followed. Node A forwards to node X″ via link 138 which againforwards via node X and so forth.

The above discussion assumes that it is possible to establish repairpaths to all the necessary targets (“primary repair paths”) but it maybe possible otherwise that targets unreachable via a primary repair pathcan be repaired from at least one other target which can be reached fromthe cooperating or neighboring node (“secondary repair path”).Accordingly if a cooperating node cannot install primary repair pathsfor some set of targets then it should install a transition tunnel withan end point of node A, the neighboring node to the failed component,for the set of nodes reachable through otherwise unreachable targets onthe assumption that A will have computed appropriate secondary repairpaths. The phase 3 timer is required to ensure that the neighboring node(e.g. node A) does not remove its repair paths before the cooperatingnodes have removed their transition tunnels and replaced them with theirnew paths, as otherwise any cooperating nodes relying on secondaryrepair paths via the neighboring node would continue to forward leadingto the potential formation of loops. However neighboring nodes with acomplete set of primary repair paths can replace their repair paths withthe new path at the end of phase 1. This is because if the neighboringnode has a complete set of primary repair paths then it can be shownthat all of the other nodes must as well such that none of thecooperating nodes will be relying on node A to provide secondary repairpaths and tunneling to node A. Indeed this can be adopted as anoptimization whereby all traffic from cooperating nodes is tunneled tothe neighboring node that issued the covert announcement whose repairpaths are then relied on, although this increases the encapsulationburden on the neighboring node. As discussed above, allocation of whichrepair path or transition path to use for a given packet is achieved byassessing which target node it would have traversed if the failedcomponent were operational, and sending it down the tunnel to thattarget node. If traffic is being tunneled only to the neighboring nodethen its own allocation routine can be relied on and it is onlynecessary at a cooperating node to identify the destination whichpreviously would have been reached by traversing the failed componentand tunneling all traffic for that destination to a neighboring nodewith repair paths installed.

In the case of multiple concurrent failures then the cooperating nodewill receive multiple covert announcements. In the event that the covertannouncements are in relation to the same failure then the transitionroutes can be installed as described above. However if it is establishedthat more than one component has failed then the cooperating nodeproceeds to phase 3—in other words it installs its new path in aconventional manner.

Although the discussion above is in relation to notification of a failedcomponent it is also possible that the component is untraversable orotherwise undergoes a change of state for other reasons such asmodification of a link cost, introduction of a new or repaired link ornode to service, or withdrawal of a link or node from service.

In the case of a modified link cost, the covert failure announcement isreplaced by a covert link change announcement. Cooperating routers theninstall transition tunnels under the same conditions as described abovebut based on new next hops as a result of the modification in link costsrather than removal of the link (or associated components) altogether.Those routers that need to install a transition tunnel perform an SPFusing the lower of the new and old link cost, and then install thetransition tunnels they will need as if the link had failed. Repairtunnels are not required from the neighbors of the link because it isstill up.

Where a link is withdrawn this is equivalent to setting the link cost toinfinity and the system follows the same process as the correspondinglink cost modification approach described above. Neighboring nodescontinue to forward across the link until the phase 3 transition iscompleted.

As regards withdrawal of a node, if this is announced by the node itselftransition routes are installed as described above, however neighbors ofthe withdrawn node continue to forward through the withdrawn node untilthe phase 3 transition is completed.

Upon introduction of a link the method deals with this as for acorresponding link cost modification. Nodes adjacent to the link can useit immediately and do not need to introduce their own repair paths.

Upon introduction of a node, an additional transitional phase isrequired to allow the new node to acquire the complete LSP database,which phase is completed for example upon an appropriate timeout. Uponcompletion of the transition phase the new node issues a covertannouncement and starts forwarding normally. All cooperating nodes enterphase 1 of a network transition and follow the method described above.The new node makes an overt announcement of its fully operational statuson expiry of the phase 1 timer.

Where two changes start simultaneously, all cooperating nodes andneighboring nodes proceed directly to phase 3, that is, normalinstallation of new paths is implemented.

It will be noted that the transition route approach described above canbe implemented in conjunction with an incremental cost changeadvertisement approach of the type described in Shand. A selection ofthe appropriate mechanism can be made by the appropriate node. In thecase of a link cost change the node being managed can impose theselected strategy on the rest of the network. In the case of a failureof a link or node, the cooperating neighbor nodes can select theappropriate strategy.

The mechanism by which the transition routes and repair paths are storedand implemented will be well known to the skilled person such that adetailed description is not required here. The routes are calculated inthe existing routing code as a natural extension of the computation ascarried out in any event. Although in the above discussion thetransition routes are pre-computed, alternatively they can be computedupon receipt of the covert announcement. The various databases andtables storing the routing and forwarding information can be updated inany appropriate manner, for example varying appropriate data fields orpointers in database entries or by storing repair paths along withnormal entries. The above discussion assumes that each node is capableof acting as a tunnel termination point and performing directedforwarding or an equivalent mechanism which may not be the case for allrouters. To the extent that a node is available to carry out theappropriate functions this can be advertised by modifying theappropriate fields in the advertisement and where this is not present,it can be inferred that the router sending an advertisement does notsupport tunnel termination. This can be a further factor in selecting adesired intermediate node.

Similarly the additional code required to implement the method, such asrecognition and processing of the covert announcement, and carrying outthe relevant steps on expiry of the respective timers will be apparentto the skilled reader and will be a simple modification of the existingcode. The timers themselves can use existing network wide timercapability. In relation to propagation of non-standard packets such ascovert announcements, this can be incorporated in any appropriateprotocol. For example in the IS-IS protocol the covert announcement canbe issued via a suitable TLV in an LSP.

4.0 Implementation Mechanisms—Hardware Overview

FIG. 9 is a block diagram that illustrates a computer system 140 uponwhich the method may be implemented. The method is implemented using oneor more computer programs running on a network element such as a routerdevice. Thus, in this embodiment, the computer system 140 is a router.

Computer system 140 includes a bus 142 or other communication mechanismfor communicating information, and a processor 144 coupled with bus 142for processing information. Computer system 140 also includes a mainmemory 146, such as a random access memory (RAM), flash memory, or otherdynamic storage device, coupled to bus 142 for storing information andinstructions to be executed by processor 144. Main memory 146 also maybe used for storing temporary variables or other intermediateinformation during execution of instructions to be executed by processor144. Computer system 140 further includes a read only memory (ROM) 148or other static storage device coupled to bus 142 for storing staticinformation and instructions for processor 144. A storage device 150,such as a magnetic disk, flash memory or optical disk, is provided andcoupled to bus 142 for storing information and instructions.

A communication interface 158 may be coupled to bus 142 forcommunicating information and command selections to processor 144.Interface 158 is a conventional serial interface such as an RS-232 orRS-422 interface. An external terminal 152 or other computer systemconnects to the computer system 140 and provides commands to it usingthe interface 158. Firmware or software running in the computer system140 provides a terminal interface or character-based command interfaceso that external commands can be given to the computer system.

A switching system 156 is coupled to bus 142 and has an input interfaceand a respective output interface (commonly designated 159) to externalnetwork elements. The external network elements may include a pluralityof additional routers 160 or a local network coupled to one or morehosts or routers, or a global network such as the Internet having one ormore servers. The switching system 156 switches information trafficarriving on the input interface to output interface 159 according topre-determined protocols and conventions that are well known. Forexample, switching system 156, in cooperation with processor 144, candetermine a destination of a packet of data arriving on the inputinterface and send it to the correct destination using the outputinterface. The destinations may include a host, server, other endstations, or other routing and switching devices in a local network orInternet.

The computer system 140 implements as a router acting as a cooperatingor neighboring node the above described method of constructing atransition route around a link 159 or the router 160 connected to it oranother router. The implementation is provided by computer system 140 inresponse to processor 144 executing one or more sequences of one or moreinstructions contained in main memory 146. Such instructions may be readinto main memory 146 from another computer-readable medium, such asstorage device 150. Execution of the sequences of instructions containedin main memory 146 causes processor 144 to perform the process stepsdescribed herein. One or more processors in a multi-processingarrangement may also be employed to execute the sequences ofinstructions contained in main memory 146. In alternative embodiments,hard-wired circuitry may be used in place of or in combination withsoftware instructions to implement the method. Thus, embodiments are notlimited to any specific combination of hardware circuitry and software.

The term “computer-readable medium” as used herein refers to any mediumthat participates in providing instructions to processor 144 forexecution. Such a medium may take many forms, including but not limitedto, non-volatile media, volatile media, and transmission media.Non-volatile media includes, for example, optical or magnetic disks,such as storage device 150. Volatile media includes dynamic memory, suchas main memory 146. Transmission media includes coaxial cables, copperwire and fiber optics, including the wires that comprise bus 142.Transmission media can also take the form of wireless links such asacoustic or electromagnetic waves, such as those generated during radiowave and infrared data communications.

Common forms of computer-readable media include, for example, a floppydisk, a flexible disk, hard disk, magnetic tape, or any other magneticmedium, a CD-ROM, any other optical medium, punch cards, paper tape, anyother physical medium with patterns of holes, a RAM, a PROM, and EPROM,a FLASH-EPROM, any other memory chip or cartridge, a carrier wave asdescribed hereinafter, or any other medium from which a computer canread.

Various forms of computer readable media may be involved in carrying oneor more sequences of one or more instructions to processor 144 forexecution. For example, the instructions may initially be carried on amagnetic disk of a remote computer. The remote computer can load theinstructions into its dynamic memory and send the instructions over atelephone line using a modem. A modem local to computer system 140 canreceive the data on the telephone line and use an infrared transmitterto convert the data to an infrared signal. An infrared detector coupledto bus 142 can receive the data carried in the infrared signal and placethe data on bus 142. Bus 142 carries the data to main memory 146, fromwhich processor 144 retrieves and executes the instructions. Theinstructions received by main memory 146 may optionally be stored onstorage device 150 either before or after execution by processor 144.

Interface 159 also provides a two-way data communication coupling to anetwork link that is connected to a local network. For example, theinterface 159 may be an integrated services digital network (ISDN) cardor a modem to provide a data communication connection to a correspondingtype of telephone line. As another example, the interface 159 may be alocal area network (LAN) card to provide a data communication connectionto a compatible LAN. Wireless links may also be implemented. In any suchimplementation, the interface 159 sends and receives electrical,electromagnetic or optical signals that carry digital data streamsrepresenting various types of information.

The network link typically provides data communication through one ormore networks to other data devices. For example, the network link mayprovide a connection through a local network to a host computer or todata equipment operated by an Internet Service Provider (ISP). The ISPin turn provides data communication services through the world widepacket data communication network now commonly referred to as the“Internet”. The local network and the Internet both use electrical,electromagnetic or optical signals that carry digital data streams. Thesignals through the various networks and the signals on the network linkand through the interface 159, which carry the digital data to and fromcomputer system 140, are exemplary forms of carrier waves transportingthe information.

Computer system 140 can send messages and receive data, includingprogram code, through the network(s), network link and interface 159. Inthe Internet example, a server might transmit a requested code for anapplication program through the Internet, ISP, local network andcommunication interface 158. One such downloaded application providesfor the method as described herein.

The received code may be executed by processor 144 as it is received,and/or stored in storage device 150, or other non-volatile storage forlater execution. In this manner, computer system 140 may obtainapplication code in the form of a carrier wave.

5.0 Extensions and Alternatives

In the foregoing specification, the invention has been described withreference to specific embodiments thereof. It will, however, be evidentthat various modifications and changes may be made thereto withoutdeparting from the broader spirit and scope of the invention. Thespecification and drawings are, accordingly, to be regarded in anillustrative rather than a restrictive sense.

Any appropriate routing protocol and mechanism can be adopted toimplement the invention. The method steps set out can be carried out inany appropriate order and aspects from the examples and embodimentsdescribed juxtaposed or interchanged as appropriate.

Although the computation of the repair path and transition route isdiscussed as taking place at the relevant node it can equally occur at aremote node which then downloads paths to all nodes. Although tunnelingand directed forwarding are discussed as technique for forwardingpackets to or from the intermediate node, any appropriate packet routingmechanism can be adopted as long as it is supported by the relevantnodes, for example loose or strict source routing. The method steps setout can be carried out in any appropriate order, for example P and Qspace can be constructed in any order or indeed simultaneously.

It will be appreciated that any appropriate routing protocol can be usedsuch as Intermediate System—Intermediate System (IS-IS) or Open ShortestPath First (OSPF). Similarly any appropriate network can provide theplatform for implementation of the method.

Although computation of the transition routes is described above asbeing carried out in real time upon receipt of a covert announcement itwill be recognized that alternatively transition routes can bepre-computed for all possible failures and instituted immediately uponreceipt of a covert announcement of a specific failure which wouldshorten phase 1, but increase computation and storage requirements.Similarly it will be seen that the system will work irrespective ofwhether the network is composed entirely of cooperating nodes or whetherit has a mixed cooperating and non-cooperating nodes. In the cases thatthere were only cooperating nodes in a network then phase 2 would not berequired as it would not be necessary to accommodate the installation innon-cooperating routers of normal updated paths such that, once allcooperating nodes had installed their transition routes the system couldimmediately progress to phase 3.

1. A method of managing a transition, in a data communications networkhaving as components nodes and links, of a first component, comprisingthe steps of: detecting the first component transition; issuing atransition notification identifying the first component and recognizableby nodes configured to construct a transition route around the firstcomponent; and upon expiry of a notification transition period, issuinga transition advertisement recognizable by all nodes on a network.
 2. Amethod as claimed in claim 1 further comprising constructing a repairpath around the first component from an adjacent component thereof upondetection of the first component transition.
 3. A method as claimed inclaim 2 further comprising removing the repair path upon expiry of arepair transition period.
 4. A method as claimed in claim 3 in which therepair transition period expires upon construction of transition routesby all nodes in the network configured to construct transition routes.5. A method as claimed in claim 1 further comprising detecting andspecifying in a transition notification whether the first component is anode or a link.
 6. A method as claimed in claim 1 further comprisingvarying the cost of a link associated with the first component by anincremental value; and advertising the varied cost in the transitionadvertisement.
 7. A method as claimed in claim 1 further comprising, ata non-neighboring node, receiving the transition notification, andconstructing a transition route around the first component.
 8. A methodas claimed in claim 7 in which the notification transition periodexpires after construction of transition routes by all nodes in thenetwork configured to construct transition nodes.
 9. A method as claimedin claim 7 further comprising removing the transition route upon expiryof an advertisement transition period.
 10. A method as claimed in claim1 further comprising, at a non-neighboring node, constructing a tunnelto the adjacent component.
 11. A computer readable storage mediumcomprising one or more sequences of instructions for managing atransition, in a data communication network having as components nodesand links, of a first component, which instructions, when executed byone or more processors, cause the one or more processors to perform:detecting the first component transition; issuing a transitionnotification identifying the first component and recognizable by nodesconfigured to construct a transition route around the first component;and upon expiry of a notification transition period, issuing atransition advertisement recognizable by all nodes on a network.
 12. Thecomputer-readable storage medium of claim 11 further comprisinginstructions which when executed cause constructing a repair path aroundthe first component from an adjacent component thereof upon detection ofthe first component transition.
 13. The computer-readable storage mediumof claim 11 further comprising instructions which when executed causevarying the cost of a link associated with the first component by anincremental value, and advertising the varied cost in the transitionadvertisement.
 14. The computer-readable storage medium of claim 11further comprising instructions which when executed cause, at anon-neighboring node, receiving the transition notification, andconstructing a transition route around the first component.
 15. Anapparatus for managing a transition, in a data communications networkhaving as components nodes and links, of a first component, comprising:means for detecting the first component transition; means for issuing atransition notification identifying the first component and recognizableby nodes configured to construct a transition route around the firstcomponent; and means for issuing a transition advertisement recognizableby all nodes on a network upon expiry of a notification transitionperiod.
 16. The apparatus of claim 15 further comprising means forconstructing a repair path around the first component from an adjacentcomponent thereof upon detection of the first component transition. 17.The apparatus of claim 15 further comprising means for varying the costof a link associated with the first component by an incremental value,and for advertising the varied cost in the transition advertisement. 18.The apparatus of claim 15 further comprising, at a non-neighboring node,means for receiving the transition notification, and for constructing atransition route around the first component.
 19. An apparatus formanaging a transition, in a data communications network having ascomponents nodes and links, of a first component, the apparatuscomprising: one or more processors; a network interface communicativelycoupled to the processor and configured to communicate one or morepacket flows among the processor and a network; and a computer readablemedium comprising one or more sequences of instructions for managing atransition, in a data communication network having as components nodesand links, of a first component, which instructions, when executed byone or more processors cause the one or more processors to perform:detecting the first component transition; issuing a transitionnotification identifying the first component and recognizable by nodesconfigured to construct a transition route around the first component;and upon expiry of a notification transition period, issuing atransition advertisement recognizable by all nodes on a network.
 20. Theapparatus of claim 19 further comprising instructions which whenexecuted cause constructing a repair path around the first componentfrom an adjacent component thereof upon detection of the first componenttransition.
 21. The apparatus of claim 19 further comprisinginstructions which when executed cause varying the cost of a linkassociated with the first component by an incremental value; andadvertising the varied cost in the transition advertisement.
 22. Theapparatus of claim 19 further comprising instructions which whenexecuted cause, at a non-neighboring node, receiving the transitionnotification, and constructing a transition route around the firstcomponent.
 23. A method of constructing a route in a data communicationnetwork comprising the steps of: receiving a notification identifying afirst component transition, at a non-neighboring node thereof from aneighboring node thereof; and constructing a tunnel from thenon-neighboring node to the neighboring node.
 24. A method as claimed inclaim 23 further comprising constructing a repair path around the firstcomponent from the adjacent component upon detection of the firstcomponent transition.
 25. An apparatus for constructing a route in adata communications network comprising means for receiving anotification identifying a first component transition, at anon-neighboring node thereof from a neighboring node thereof; and meansfor constructing a tunnel from the non-neighboring node to theneighboring node.
 26. An apparatus for constructing a route in a datacommunications network, the apparatus comprising: one or moreprocessors; a network interface communicatively coupled to the processorand configured to communicate one or more packet flows among theprocessor and a network; and a computer readable medium comprising oneor more sequences of instructions for constructing a route in a datacommunication network which instructions, when executed by one or moreprocessors cause the one or more processors to perform: receiving anotification identifying a first component transition, at anon-neighboring node thereof from a neighboring node thereof; andconstructing a tunnel from the non-neighboring node to the neighboringnode.
 27. The apparatus of claim 26 further comprising instructionswhich when executed cause constructing a repair path around the firstcomponent from the adjacent component upon detection of the firstcomponent transition.